Compiling Model-Based Diagnosis to Boolean Satisfaction
نویسندگان
چکیده
This paper introduces an encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The is based a combination sophisticated MBD preprocessing algorithms and SAT compilation techniques which together provide concise CNF formula. Experimental evidence indicates that our approach superior all published for MBD. In particular, we can determine, the first time, diagnoses entire standard ISCAS-85 benchmark. Our results open way improve state-of-the-art range similar problems.
منابع مشابه
Compiling Model-Based Diagnosis to Boolean Satisfaction
This paper introduces an encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and SAT compilation techniques which together provide concise CNF formula. Experimental evidence indicates that our approach is superior to all published algorithms for minim...
متن کاملCompiling ARGOS into Boolean Equations
In most imperative synchronous languages (Esterel, Argos, State-charts,...), the semantics of the control structures may be conveniently described as compositions of Mealy machines. This constitutes the usual formal semantics of Argos, for instance, where basic components are Mealy machines. On the other hand, the compilation process should not be based upon an explicit generation of the Mealy ...
متن کاملCompiling constraint satisfaction problems
Many tasks requiring intelligence, in particular scheduling and planning, must be solved under time constraints. This is diicult to achieve because of the combinato-rial nature of such tasks. While search heuristics can give good average performance, they cannot give any peformance guarantees for a particular instance. Fortunately, the tasks are often very similar. Therefore, compiling partial ...
متن کاملmortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولProving Termination with (Boolean) Satisfaction
At some point there was the Davis-Putnam-Logemann-Loveland (DPLL) algorithm [6]. Forty five years later, research on Boolean satisfiability (SAT) is still ceaselessly generating even better SAT solvers capable of handling even larger SAT instances. Remarkably, the majority of these tools still bear the hallmark of the DPLL algorithm. In sync with the availability of progressively stronger SAT s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v26i1.8222